A Process Algebra of Concurrent Constraint Programming
نویسندگان
چکیده
We develop an algebraic theory for the observational equivalence of concurrent constraint programs which identifies processes which have the same final results for all possible executions.
منابع مشابه
Computer Science Technical Reports a Process Algebra for Synchronous Concurrent Constraint Programming a Process Algebra for Synchronous Concurrent Constraint Programming
Concurrent constraint programming is classically based on asynchronous communication via a shared store. Synchrony can be achieved by forcing concurrently running ask and tell primitives to synchronise on \new common information". This paper outlines this framework, called Scc, and develops an algebraic semantics for it. The Scc framework is shown to share similarities with both the traditional...
متن کاملA Process Algebra for Synchronous Concurrent Constraint Programming
Concurrent constraint programming is classically based on asynchronous communication via a shared store. This paper presents new version of the ask and tell primitives which features synchronicity. Our approach is based on the idea of telling new information just in the case that a concurrently running process is asking for it. An operational and an algebraic semantics are deened. The algebraic...
متن کاملThe tccp Interpreter
The Timed Concurrent Constraint Language (tccp in short) is a constraint-based concurrent language inspired in process algebra. The language is well-suited for the specification of concurrent and reactive systems. tccp is parametric w.r.t. a constraint system, what is a main characteristic of the Concurrent Constraint Paradigm of Saraswat. Maude is an executable rewriting logic language special...
متن کاملProcess Algebra for Agent Communication: A General Semantic Approach
In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent Constraint Programming (CCP) with a generalisation of the synchronous handshaking communication mechanism of Communicating Sequential Processes (CSP). The operational semantics of ACPL is given in terms of a transition system ...
متن کامل(Hybrid) automata and (stochastic) programsThe hybrid automata lattice of a stochastic program
We define a semantics for stochastic Concurrent Constraint Programming (sCCP), a stochastic process algebra, in terms of stochastic hybrid automata with piecewise deterministic continuous dynamics. To each program we associate a lattice of hybrid models, parameterized with respect to the degree of discreteness left. We study some properties of this lattice, presenting also an alternative semant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992